Symmetric graph

Results: 67



#Item
31

PDF Document

Add to Reading List

Source URL: www.math.sinica.edu.tw

Language: English - Date: 2003-10-08 02:41:27
32Fibrations of Graphs Paolo Boldi∗ Sebastiano Vigna∗  Abstract

Fibrations of Graphs Paolo Boldi∗ Sebastiano Vigna∗ Abstract

Add to Reading List

Source URL: vigna.di.unimi.it

Language: English - Date: 2002-05-18 04:50:30
33Querying Graph Patterns Pablo Barcelo Leonid Libkin  Juan Reutter

Querying Graph Patterns Pablo Barcelo Leonid Libkin Juan Reutter

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2011-04-05 12:57:54
34(Enumeration Results for) Signed Graphs Matthias Beck San Francisco State University [John Stembridge]

(Enumeration Results for) Signed Graphs Matthias Beck San Francisco State University [John Stembridge]

Add to Reading List

Source URL: math.nist.gov

Language: English - Date: 2014-09-04 14:50:31
35PHYSICAL REVIEW E 87, Overlapping community detection in complex networks using symmetric binary matrix factorization Zhong-Yuan Zhang* School of Statistics, Central University of Finance and Economics, Ha

PHYSICAL REVIEW E 87, Overlapping community detection in complex networks using symmetric binary matrix factorization Zhong-Yuan Zhang* School of Statistics, Central University of Finance and Economics, Ha

Add to Reading List

Source URL: www.yongyeol.com

Language: English - Date: 2013-06-28 15:55:49
36Tests for Symmetry There are three types of symmetry: symmetric with respect to the y-axis, symmetric with respect to the x-axis, and symmetric with respect to the origin. 1. If (x, y) is a point on the graph and (-x, y)

Tests for Symmetry There are three types of symmetry: symmetric with respect to the y-axis, symmetric with respect to the x-axis, and symmetric with respect to the origin. 1. If (x, y) is a point on the graph and (-x, y)

Add to Reading List

Source URL: media.tripod.lycos.com

Language: English - Date: 2011-04-20 14:12:10
37Lederberg J. "Topological Mapping of Organic Molecules" Reprinted from the Proceedings of the National Academy of Sciences 53(1): [removed], January 1965.

Lederberg J. "Topological Mapping of Organic Molecules" Reprinted from the Proceedings of the National Academy of Sciences 53(1): [removed], January 1965.

Add to Reading List

Source URL: www.garfield.library.upenn.edu

Language: English - Date: 2003-10-22 15:51:34
38THEOREM OF THE DAY Theorem (Cameron, 1982) For any integer k > 2 there exist only finitely many distance-transitive kregular graphs. The Biggs-Smith graph is the largest distance-transitive graph that is 3-regular (every

THEOREM OF THE DAY Theorem (Cameron, 1982) For any integer k > 2 there exist only finitely many distance-transitive kregular graphs. The Biggs-Smith graph is the largest distance-transitive graph that is 3-regular (every

Add to Reading List

Source URL: www.theoremoftheday.org

Language: English - Date: 2014-02-07 05:07:16
39Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy Tyson Williams University of Wisconsin-Madison Joint with: Jin-Yi Cai (University of Wisconsin-Madison)

Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy Tyson Williams University of Wisconsin-Madison Joint with: Jin-Yi Cai (University of Wisconsin-Madison)

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2012-01-11 15:55:05
40DIHEDRAL COVERS OF THE COMPLETE GRAPH K5 M. GHASEMI Abstract. A regular cover of a connected graph is called dihedral if its transformation group is dihedral. In this paper, the author classifies all dihedral coverings o

DIHEDRAL COVERS OF THE COMPLETE GRAPH K5 M. GHASEMI Abstract. A regular cover of a connected graph is called dihedral if its transformation group is dihedral. In this paper, the author classifies all dihedral coverings o

Add to Reading List

Source URL: www.kurims.kyoto-u.ac.jp

Language: English - Date: 2014-05-27 07:51:07